Experiment with Peer Instruction in Computer Science to Enhance Class Attendance

Class attendance of computer science courses in higher education is typically not overwhelming. Anecdotal reports and the authors’ experiences with a low-resource mode of peer instruction indicated increased class attendance after a lecture with such concept tests. This has been evaluated systematically with a 3rd-year computer science module using a medium-resource, software-based, Audience Response System (‘clickers’). Results show there is neither a positive nor a negative relation between lectures with peer instruction (PI) and class attendance. The student participation rate in software-based voting decreased and some decline in lecture attendance was observed. Thus, PI itself could not be shown to be a useful strategy to enhance class attendance. Notwithstanding, the students’ evaluation of the use of PI was a moderately positive

Representing and aligning similar relations: parts and wholes in isiZulu vs English

Ontology-enabled medical information systems are used in Sub-Saharan Africa, which require localisation of Semantic Web technologies, such as ontology verbalisation, yet keeping a link with the English language-based systems. In realising this, we zoom in on the part-whole relations that are ubiquitous in medical ontologies, and the isiZulu language. The analysis of part-whole relations in isiZulu revealed both `underspecification'---therewith also challenging the transitivity claim---and three refinements cf. the list of common part-whole relations. This was first implemented for the monolingual scenario so that it generates structured natural language from an ontology in isiZulu. Two new natural language-independent correspondence patterns are proposed to solve non-1:1 object property alignments, which are subsequently used to align the part-whole taxonomies informed by the two languages

A note on the compatibility of part-whole relations with foundational ontologies

Parthood in mereology is one relation, and typically is included in foundational ontologies. Some of these foundational ontologies and many domain ontologies use a plethora of parthood and part-whole relations, such as `sub process' and `portion'. This poses requirements on the foundational ontologies and, perhaps, Ontology, on what to do with these two different approaches to part-whole relations. We present an analysis of DOLCE, BFO, GFO, SUMO, GIST, and YAMATO on their inclusion and use of part-whole relations. It demonstrates there is no perfect fit with either for various reasons. We then aim to bridge this gap with an orchestration of ontologies of part-whole relations that are aligned to several foundational ontologies and such that they can be imported into other ontologies

Preventing, Detecting, and Revising Flaws in Object Property Expressions

The OWL 2 DL ontology language is very expressive and has many features for declaring complex object property expressions. Standard reasoning services for OWL ontologies take these expressions as correct and according to the ontologist's intention. However, the more one can do, the higher the chance modelling flaws are introduced; hence, an unexpected or undesired classification or inconsistency in the class hierarchy may actually be due to a mistake in the 'object property box', not the class axioms. We analyse the principles of subsumption in object property hierarchies, and use it to identify the types of flaws that can occur in object property expressions. We propose the compatibility services SubProS and ProChainS that check for meaningful property hierarchies and property chaining and propose how to revise a flaw. These insights can also be used to prevent flaws and to choose the best option, which we demonstrate with the chain pattern for upward and downward distributivity over parthood relations. SubProS and ProChainS were evaluated with several ontologies, which demonstrates that such flaws do exist, that they can be isolated effectively, and useful suggestions for revisions can be proposed

Natural language template selection for temporal constraints

Representing temporal knowledge and information in temporal logics for ontologies and conceptual data models has faced issues due to inaccessibility of the underlying logic and limited intuitiveness of diagrammatic extensions to the modelling languages. We aim to address this by designing controlled natural language templates for generating sentences that verbalise in English the temporal constraints defined in a temporal logic. We devised 101 templates, which were evaluated by experts in temporal logics and by novice temporal modellers on semantic adequacy and preference. There was only 12\% unanimity among the experts, and 89\% by majority voting. The novice temporal modellers were much more lenient in judgment on whether the templates captured the semantics adequately. Instead of a direct 1:1 mapping between an axiom's components and the natural language rendering, the more natural-sounding sentences were preferred, therewith linking an axiom type as a whole to a template

Limitations of Regular Terminology Development practices: the case of the isiZulu Computing Terminology

Terminology development for a scientific discipline is an essential prerequisite for education in the chosen language. The young disciplines of Computer Science and Information Technology are lagging behind in this respect for many non-English languages. Between the few resources for isiZulu that exist, isiZulu computer literacy terms often differ. This suggests that any resultant terminology in an evolving scientific discipline will differ depending on who is consulted and how, affecting its quality and stability. We evaluated this with three experiments: an experts-only workshop, two online surveys, and voting on computer literacy terms. We obtained the, at present, longest list consisting of 233 terms for 146 entities. There are notable differences in preferred terms between experts and computer literate users, and while the passive voting yielded more results quicker than the surveys, some entities still have many different isiZulu terms. The results indicate that a broadly participative and inclusive collection and proposal stage yielding multiple contenders for an entity should be a compulsory and explicit stage before, and possibly also during, multidisciplinary terminology development workshops

Orchestrating a Network of Mereo(topo)logical Theories

Parthood is used widely in ontologies across subject domains. Some modelling guidance can be gleaned from Ontology, yet it offers multiple mereological theories, and even more when combined with topology, i.e., mereotopology. To complicate the landscape, decidable languages put restrictions on the language features, so that only fragments of the mereo(topo)logical theories can be represented, yet during modelling, those full features may be needed to check correctness. We address these issues by specifying a structured network of theories formulated in multiple logics that are glued together by the various linking constructs of the Distributed Ontology Language, \DOL. For the KGEMT mereotopological theory and five sub-theories, together with the DL-based OWL species and first- and second-order logic, this network in \DOL orchestrates 28 ontologies. Further, we propose automated steps toward resolution of language feature conflicts when combining modules, availing of the new `OWL classifier' tool that pinpoints profile violations

Automatically changing modules in modular ontology development and management

Modularity has been proposed as a solution to deal with large ontologies. This requires, various module management tasks, such as swapping an outdated module for a new one or a computationally costly one for a leaner fragment. No mechanism exists to exchange an arbitrary module automatically. To solve this manual task, we modify the SUGOI algorithm into SUGOI-Gen; with SUGOI-Gen, one can swap any module within a modular system, implemented it, and wrapped a GUI around it. We carried out an experimental evaluation with six ontologies covering three different use-cases to determine whether arbitrary interchangeability is practically doable, and to what extent such changes affect the quality of the module and automated reasoning over it. The results are positive, with the success rate varying between 22-100% depending on the number of mappings between the source and target module. The evaluation also revealed that the interchangeability does indeed have an impact on a module’s metrics. Regarding reasoning, when comparing an original ontology to one where a module has been swapped, the processing time is greatly improved for all except one of the swapped modules in the set

Toward a knowledge-to-text controlled natural language of isiZulu

The language isiZulu belongs to the Nguni group of languages, which also include isiXhosa, isiNdebele and siSwati. Of the four Nguni languages, isiZulu is the most dominant language in South Africa, which is spoken by 22.7\% of the country's 51.8 million population. However, isiZulu (and even more so the other Nguni languages) still remains an under-resourced language for software applications. In this article we focus on controlled natural languages for structured knowledge-to-text viewed from a potential utility for verbalising business rules and OWL ontologies. IsiZulu grammar---and by extension, all Bantu languages---shows that a template-based approach is infeasible. This is due to, mainly, the noun class system, the agglutination and verb conjugation with concords for each noun class. We present verbalisation patterns for existential and universal quantification, taxonomic subsumption, axioms with simple properties, and basic cases of negation. Based on the preliminary user assessment of the patterns, selected ones are refined into algorithms for verbalisation to generate correct isiZulu sentences, which have been evaluated

Grammar rules for the isiZulu complex verb

The isiZulu verb is known for its morphological complexity, which is a subject of on-going linguistics research, as well as for prospects of computational use, such as controlled natural language interfaces, machine translation, and spellcheckers. To this end, we seek to answer the question as to what the precise grammar rules for the isiZulu complex verb are (and, by extension, the Bantu verb morphology). To this end, we iteratively specify the grammar as a Context Free Grammar, and evaluate it computationally. The grammar presented in this paper covers the subject and object concords, negation, present tense, aspect, mood, and the causative, applicative, stative, and the reciprocal verbal extensions, politeness, the wh-question modifiers, and aspect doubling, ensuring their correct order as they appear in verbs. The grammar conforms to specification